Bit Reversal through Direct Fourier Permutation Method and Vectorial Digit Reversal Generalization
نویسنده
چکیده
This paper describes the Direct Fourier Permuation Algorithm, an efficient method of computing Bit Reversal of natural indices [1, 2, 3, . . . , 2] in a vectorial manner (k iterations) and also proposes the Vectorial Digit Reversal Algorithm, a natural generalization of Direct Fourier Permutation Algorithm that is enabled to compute the r-digit reversal of natural indices [1, 2, 3, . . . , r] where r is an arbitrary radix. Matlab functions implementing these two algorithms and various test and comparative results are presented in this paper to support the idea of inclusion of these two algorithms in the next Matlab Signal Processing Toolbox official distribution package as much faster alternatives to current Matlab functions bitrevorder and digitrevorder. MSC 2000: 65T50, 65T99, 65K05, 68W01. ACM CCS 1998: G.4., D.3.3.
منابع مشابه
D 6 . 10 Fast Bit - Reversal Algorithms
Several numerical computations, including the Fast Fourier Transform 0, require that the data is ordered according to a bit-reversed permutation. In fact, for several standard FIT programs, this pre or post computation is claimed to take 10-50 percent of the computation time [l]. In this paper, a linear sequential bit-reversal algorithm is presented. This is an improvement by a factor of logzn ...
متن کاملBit Reversal on Uniprocessors
Bit reversal, hierarchical memory, Fast Fourier Transform Many versions of the Fast Fourier Transform require a reordering of either the input or the output data that corresponds to reversing the order of the bits in the array index. There has been a surprisingly large number of papers on this subject in the recent literature. This paper collects 30 methods for bit reversing an array. Each meth...
متن کاملPerfect trees and bit-reversal permutations
A famous algorithm is the Fast Fourier Transform, or FFT. An eecient iterative version of the FFT algorithm performs as a rst step a bit-reversal permutation of the input list. The bit-reversal permutation swaps elements whose indices have binary representations that are the reverse of each other. Using an amortized approach this operation can be made to run in linear time on a random-access ma...
متن کاملTransposing Arrays on Multicomputers Using de Bruijn Sequences
Transposing an N × N array that is distributed rowor column-wise across P = N processors is a fundamental communication task that requires time-consuming interprocessor communication. It is the underlying communication task for the fast Fourier transform of long sequences and multi-dimensional arrays. It is also the key communication task for certain weather and climate models. A parallel trans...
متن کاملPerformance of Parallel Bit-Reversal with Cilk and UPC for Fast Fourier Transform
Bit-reversal is widely known being an important program, as essential part of Fast Fourier Transform. If not carefully and well designed, it may easily take large portion of FFT application’s total execution time. In this paper, we present a parallel implementation of Bit-reversal for FFT using Cilk and UPC. Based on our previous work of creating parallel Bit-reversal using OpenMP in SPMD style...
متن کامل